Construction of hyperelliptic function fields of high three-rank
نویسندگان
چکیده
We present several explicit constructions of hyperelliptic function fields whose Jacobian or ideal class group has large 3-rank. Our focus is on finding examples for which the genus and the base field are as small as possible. Most of our methods are adapted from analogous techniques used for generating quadratic number fields whose ideal class groups have high 3-rank, but one method, applicable to finding large l-ranks for odd primes l ≥ 3, is new and unique to function fields. Algorithms, examples, and numerical data
منابع مشابه
Globalization and Employment
In this paper we study the compatibility of Cohen-Lenstra heuristics with Leopoldt’s Spiegelungssatz (the reflection theorem). We generalize Dutarte’s ([1983, in “Théorie des nombres, Besançon, 1983-1984”]) work to every prime number p : he proved the compatibility of the Cohen-Lenstra conjectures with the Spiegelungssatz in the case p = 3. We also show that the Spiegelungssatz is compatible wi...
متن کاملAn analysis of the infrastructure in real function fields
We construct a map injecting the set of infrastructure ideals in a real function field into the class group of the correspoding hyperelliptic curve. This map respects the ‘group-like’ structure of the infrastructure, as a consequence of this construction we show that calculating distances in the set of infrastructure ideals is equivalent to the DLP in the underlying hyperelliptic curve. We also...
متن کاملSmooth Ideals in Hyperelliptic Function Fields Smooth Ideals in Hyperelliptic Function Fields
Recently, several algorithms have been suggested for solving the discrete logarithm problem in the Jacobians of high-genus hyperelliptic curves over nite elds. Some of them have a provable subexponential running time and are using the fact that smooth reduced ideals are suuciently dense. We explicitly show how these density results can be derived. All proofs are purely combinatorial and do not ...
متن کاملCorrespondences on Hyperelliptic Curves and Applications to the Discrete Logarithm
The discrete logarithm is an important crypto primitive for public key cryptography. The main source for suitable groups are divisor class groups of carefully chosen curves over finite fields. Because of index-calculus algorithms one has to avoid curves of genus ≥ 4 and non-hyperelliptic curves of genus 3. An important observation of Smith [S] is that for “many” hyperelliptic curves of genus 3 ...
متن کاملOrdinary elliptic curves of high rank over Fp(x) with constant j-invariant II
We show that for all odd primes p, there exist ordinary elliptic curves over Fp(x) with arbitrarily high rank and constant j-invariant. This shows in particular that there are elliptic curves with arbitrarily high rank over these fields for which the corresponding elliptic surface is not supersingular. The result follows from a theorem which states that for all odd prime numbers p and l, there ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 77 شماره
صفحات -
تاریخ انتشار 2008